Pair-sharing over rational trees
نویسندگان
چکیده
منابع مشابه
Adaptive Solving of Equations over Rational Trees
Two variants of an incremental and adaptive uniication algorithm are presented. Both variants decide incrementally the consistency of conjunctions of syntactical equations over rational trees after any additions or deletions of syntactical equations. In the positive case, a rational solved form equivalent to the given conjunction is computed incrementally. Contrary to other incremental implemen...
متن کاملAdaptive Entailment of Equations over Rational Trees ?
Two variants of an incremental and adaptive entailment algorithm are presented. Both variants decide incrementally whether a xed conjunction of syntactical equations over the rational trees is entailed by another conjunction in rational solved form which may change dynamically. In the case of entailment, an extension of the rational solved form is computed which is equivalent to the conjunction...
متن کاملRational Secret Sharing with Honest Players over an Asynchronous Channel
We consider the problem of rational secret sharing introduced by Halpern and Teague [5], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several...
متن کاملBackward Pair Sharing Analysis
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the query is successfully executed. The analysis uses a pair sharing domain and is capable of inferring pre-conditions that ensure the absence of sharing. This, in turn, has many applications in logic programming. The work ...
متن کاملSet-Sharing is Redundant for Pair-Sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis. We show that the answer is yes. By defining an equivalence relation over the set-sharing domain we ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(00)00009-1